Function template std : : minmax and / or algorithm std : : minmax _ element

نویسنده

  • Hervé Brönnimann
چکیده

This proposal adds a function template (std::minmax) and / or an algorithm (std::minmax_element) to the header , both of which are implicitly present (by two separate calls to std::min and std::max, or std::min_element and std::max_element), but admit a better implementation if the two calls are combined into one. Both additions can be considered independently, although they are strongly related hence the common proposal. Both are very low-risk and two reference implementations are given for std::minmax_element.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weighted Minmax Algorithm for Color Image Quantization

The maximum intercluster distance and the maximum quantization error that are minimized by the MinMax algorithm are shown to be inappropriate error measures for color image quantization. A fast and effective (improves image quality) method for generalizing activity weighting to any histogram-based color quantization algorithm is presented. A new non-hierarchical color quantization technique cal...

متن کامل

A Optimal Location Queries in Road Networks

In this paper, we study an optimal location query based on a road network. Specifically, given a road network containing clients and servers, an optimal location query is to find a location on the road network such that when a new server is set up at this location, a certain cost function computed based on the clients and servers (including the new server) is optimized. Two types of cost functi...

متن کامل

On DC optimization algorithms for solving minmax flow problems

We formulate minmax flow problems as a DC. optimization problem. We then apply a DC. primal-dual algorithm to solve the resulting problem. The obtained computational results show that the proposed algorithm is efficient thanks to particular structures of the minmax flow problems.

متن کامل

The Minmax Regret Shortest Path Problem with Interval Arc Lengths

This paper considers the shortest path problem on directed acyclic graphs, where the uncertainty of input data (lengths of arcs) is modeled in the form of intervals. In order to handle the interval data the minmax criterion to the regret values is applied, where the original objective function with interval coefficients is transformed into that of finding the least maximum worst-case regret, wh...

متن کامل

Sensor Placement for Microseismic Event Location

Mining operations can produce highly localized, low intensity earthquakes that are referred to as microseismic events. Monitoring of microseismic events is useful in predicting and comprehending hazards, and in evaluating the overall performance of a mine design. A robust localization algorithm is used to estimate the source position of the microseismic event by selecting the hypothesized sourc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005